On axiomatizations of public announcement logic
نویسندگان
چکیده
In the literature, different axiomatizations of Public Announcement Logic (PAL) were proposed. Most of these axiomatizations share a ‘core set’ of the so-called reduction axioms. In particular, there is a composition axiom which stipulates how two consecutive announcements are composed into one. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that without the composition axiom the core set does not completely axiomatize PAL. In fact, most of the intuitive ‘axioms’ and rules we took for granted could not be derived from the core set. The non-standard semantics we proposed is of its own interest in modelling realistic agents. We show that with the help of different composition axioms we may axiomatize PAL w.r.t. such non-standard semantics.
منابع مشابه
Announcement as effort on topological spaces
We propose a multi-agent logic of knowledge, public and arbitrary announcements, that is interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, and d...
متن کاملBilattice Public Announcement Logic
Building on recent work on bilattice modal logic and extensions of public announcement logic to a non-classical setting, we introduce a dynamic epistemic logic having the logic of modal bilattices as propositional support. Bilattice logic is both inconsistency-tolerant and paracomplete, thus suited for applications in contexts with multiple sources of information, where one may have to deal wit...
متن کاملPositive Announcements
Arbitrary public announcement logic (APAL) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public announcement logic called positive arbitrary public announcement logic (APAL), which restricts arbitrary public announcements to announcement of positive formu...
متن کاملQuantifying over boolean announcements
Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct ✷φ intuitively expressing that “after every public announcement of a formula, formula φ is true.” The logic APAL is undecidable and it has an infinitary axiomatization. ...
متن کاملPublic Announcement Logics with Constrained Protocols
Public announcement logic (PAL) is a paradigm case of dynamic epistemic logic, which models how agents’ epistemic states change when pieces of information are communicated publicly. PAL extends epistemic logic with the operator [A], where the intended reading of [A]φ is “After a public announcement that A, φ holds.” This logic has recently received two improvements. One improvement, studied in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Synthese
دوره 190 شماره
صفحات -
تاریخ انتشار 2013